A Sperner-Type Theorem and Qualitative Independence
نویسندگان
چکیده
We determine the asymptotics of the largest family { C;} ~ 1 of subsets of an n-set with the property that for some bipartitions C; =A; u B; of the C/s none of the inclusions A; c C 1 , B; c C 1 occurs. Our construction implies a new lower bound on the size of qualitatively independent partition systems in the Renyi sense.
منابع مشابه
Sperner capacities
We determine the asymptotics of the largest family of qualitatively 2{independent k{ partitions of an n{set, for every k > 2. We generalize a Sperner-type theorem for 2{partite sets of KK orner and Simonyi to the k{partite case. Both results have the feature that the corresponding trivial information-theoretic upper bound is tight. The results follow from a more general Sperner capacity theorem...
متن کاملQualitative Independence and Sperner Problems for Directed Graphs
Sperner’s theorem about the largest family of incomparable subsets of an n-set is in fact a theorem about the largest anti-chain in the natural extension to sequences of a linear order. We replace the linear order by an arbitrary directed graph and ask for the cardinality of the largest set of incomparable sequences of length n one can form of the vertices. Two sequences are comparable if for e...
متن کاملAnother 3-Part Sperner Theorem
In this paper, we prove a higher order Sperner theorem.These theorems are stated after some notation and background results are introduced. For i, j positive integers with i ≤ j, let [i, j] denote the set {i, i + 1, . . . , j}. For k, n positive integers, set ( [n] k ) = {A ⊆ [1, n] : |A| = k}. A system A of subsets of [1, n] is said to be k-set system if A ⊆ ( [n] k ) . Two subsets A, B are in...
متن کاملAZ-Identities and Strict 2-Part Sperner Properties of Product Posets
One of central issues in extremal set theory is Sperner's theorem and its generalizations. Among such generalizations is the best-known BLYM inequality and the Ahlswede--Zhang (AZ) identity which surprisingly generalizes the BLYM into an identity. Sperner's theorem and the BLYM inequality has been also generalized to a wide class of posets. Another direction in this research was the study of mo...
متن کامل1-Sperner hypergraphs
We introduce a new class of hypergraphs, the class of 1-Sperner hypergraphs. A hypergraph H is said to be 1-Sperner if every two distinct hyperedges e, f of H satisfy min{|e \ f |, |f \ e|} = 1. We prove a decomposition theorem for 1-Sperner hypergraphs and examine several of its consequences, including bounds on the size of 1-Sperner hypergraphs and a new, constructive proof of the fact that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 59 شماره
صفحات -
تاریخ انتشار 1992